Ensemble Linear Subspace Analysis of High-Dimensional Data
نویسندگان
چکیده
منابع مشابه
Subspace Clustering of High Dimensional Data
Clustering suffers from the curse of dimensionality, and similarity functions that use all input features with equal relevance may not be effective. We introduce an algorithm that discovers clusters in subspaces spanned by different combinations of dimensions via local weightings of features. This approach avoids the risk of loss of information encountered in global dimensionality reduction tec...
متن کاملOutlying Subspace Detection for High-Dimensional Data
Knowledge discovery in databases, commonly referred to as data mining, has attracted enormous research efforts from different domains such as databases, statistics, artificial intelligence, data visualization, and so forth in the past decade. Most of the research work in data mining such as clustering, association rules mining, and classification focus on discovering large patterns from databas...
متن کاملOutlying Subspace Detection for High- dimensional Data
Knowledge discovery in databases, commonly referred to as data mining, has attracted enormous research efforts from different domains such as database, statistics, artificial intelligence, data visualization, etc, in the past decade. Most of the research work in data mining such as clustering, association rules mining and classification focus on discovering the “large patterns” from databases (...
متن کاملSoft Subspace Clustering for High-Dimensional Data
High dimensional data is a phenomenon in real-world data mining applications. Text data is a typical example. In text mining, a text document is viewed as a vector of terms whose dimension is equal to the total number of unique terms in a data set, which is usually in thousands. High dimensional data occurs in business as well. In retails, for example, to effectively manage supplier relationshi...
متن کاملAnalyzing High-Dimensional Data by Subspace Validity
We are proposing a novel method that makes it possible to analyze high dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method lies the idea of subspace validity. We map the data in a way that allows us to test the quality of subspaces using statistical tests. Experimental results, both on synthetic and real data sets, demonstrate the potential...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2021
ISSN: 1099-4300
DOI: 10.3390/e23030324